Triangles and trees, the distance matrices of which fulfil metric or ultra‐metric conditions respectively
نویسندگان
چکیده
منابع مشابه
Assessing Congruence Among Ultrametric Distance Matrices
Recently, a test of congruence among distance matrices (CADM) has been developed. The null hypothesis is the incongruence among all data matrices. It has been shown that CADM has a correct type I error rate and good power when applied to independently-generated distance matrices. In this study, we investigate the suitability of CADM to compare ultrametric distance matrices. We tested the type I...
متن کاملThe triangles method to build X-trees from incomplete distance matrices
A method to infer X-trees (valued trees having X as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2n-3 distance values between the n elements of X, if they fulfill some explicit conditions. This construction is based on the mapping between X-tree and a weighted generalized 2-tree spann...
متن کاملMetric Spaces in which All Triangles Are Degenerate Bettina
In any subspace of the real line R with the usual Euclidean metric d(x, y) = |x− y|, every triangle is degenerate. In R or R with the usual Euclidean metrics, a triangle is degenerate if and only if its vertices are collinear. With our intuition of a degenerate triangle having “collinear vertices” extended to arbitrary metric spaces, we might expect that a metric space in which every triangle i...
متن کاملRandom ultrametric trees and applications
Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time. We show how the boundary of an ultrametric tree, like any compact ultrametric space, can be represented in a simple way via the so-called comb metric. We display a variety of examples of random combs and explain...
متن کاملUltrametric Distance in Syntax
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierarchical phrase trees are subject to a similar analysis, which is much simpler as the branching structure is more readily discernible and switched. The occurrence of hierarchical structure elsewhere in linguistics is men...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ZooKeys
سال: 2011
ISSN: 1313-2970,1313-2989
DOI: 10.3897/zookeys.100.1532.app4